RNAmine: Frequent Stem Pattern Miner from RNAs
نویسندگان
چکیده
Taishin Kin4 Kiyoshi Asai4,5 [email protected] [email protected] 1 Mizuho Information & Research Institute, Inc, 2-3 Kanda-Nishikicho, Chiyoda-ku, Tokyo, Japan 2 Max Planck Institute for Biological Cybernetics, Spemannstr. 38, 72076 Tübingen, Germany 3 Google Japan, Inc, 26-1 Sakuracho, Shibuya, Tokyo, Japan 4 National Institute of Advanced Industrial Science and Technology (AIST), 2-43 Aomi, Kotoku, Tokyo, Japan 5 University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba, Japan 6 Department of Computational Intelligence and System Science, Tokyo Institute of Technology, 4259 Nagatsuta, Midori-ku, Yokohama, Japan
منابع مشابه
Mining frequent stem patterns from unaligned RNA sequences
MOTIVATION In detection of non-coding RNAs, it is often necessary to identify the secondary structure motifs from a set of putative RNA sequences. Most of the existing algorithms aim to provide the best motif or few good motifs, but biologists often need to inspect all the possible motifs thoroughly. RESULTS Our method RNAmine employs a graph theoretic representation of RNA sequences and dete...
متن کاملEvaluation of the role of mico-RNAs in cardiomyocytes differentiation of mesenchymal stem cells
Stem cells are a good alternative for regenerative medicine because of their characteristics such as self-renewal and differentiation potential. They are classified into different types of stem cells including embryonic stem cells, induced pluripotent stem cells, multipotent stem cells, and ultimately uni-potent stem cells. Mesenchymal stem cells extracted from adult tissues. Due to the lack of...
متن کاملA Novel Acceleration Technique to Improve the Speed of Mining Frequent U2 Patterns
Frequent pattern mining is the method of finding patterns like itemsets, subsequences and substructures that repeatedly occur in a dataset. In Univariate Uncertain data, each attribute present in a transaction is represented by a quantitative interval and a probability value. U2P-Miner algorithm is used to mine frequent patterns from U2 data. The number of intervals has a great impact on the ti...
متن کاملMax-Miner Algorithm Using Knowledge Discovery Process in Data Mining
Discovering frequent item sets is an important key problem in data mining applications, such as the discovery of association rules, strong rules, episodes, and minimal keys. Typical algorithms for solving this problem operate in a bottom-up, breadth-first search direction. The computation starts from frequent itemsets (the minimum length frequent itemsets) and continues until all maximal (lengt...
متن کاملFp-tree Based Spatial Co-location Pattern Mining
A co-location pattern is a set of spatial features frequently located together in space. A frequent pattern is a set of items that frequently appears in a transaction database. Since its introduction, the paradigm of frequent pattern mining has undergone a shift from candidate generation-and-test based approaches to projection based approaches. Co-location patterns resemble frequent patterns in...
متن کامل